|
In mathematics, the Johnson scheme, named after Selmer M. Johnson, is also known as the triangular association scheme. It consists of the set of all binary vectors ''X'' of length ''ℓ'' and weight ''n'', such that .〔P. Delsarte and V. I. Levenshtein, “Association schemes and coding theory,“ ''IEEE Trans. Inform. Theory'', vol. 44, no. 6, pp. 2477–2504, 1998.〕〔P. Camion, "Codes and Association Schemes: Basic Properties of Association Schemes Relevant to Coding," in ''Handbook of Coding Theory'', V. S. Pless and W. C. Huffman, Eds., Elsevier, The Netherlands, 1998.〕〔F. J. MacWilliams and N. J. A. Sloane, ''The Theory of Error-Correcting Codes'', Elsevier, New York, 1978.〕 Two vectors ''x'', ''y'' ∈ ''X'' are called ''i''th associates if dist(''x'', ''y'') = 2''i'' for ''i'' = 0, 1, ..., ''n''. The eigenvalues are given by : : where : and ''E''''k''(''x'') is an Eberlein polynomial defined by : ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Johnson scheme」の詳細全文を読む スポンサード リンク
|